/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-05-09
 * Time: 19:56
 */
//44.通配符匹配
class Solution4 {
    public boolean isMatch(String s, String p) {
        int m = s.length(), n = p.length();

        s = " "+s;
        p = " "+p;

        boolean[][] dp = new boolean[m+1][n+1];

        //初始化
        dp[0][0] = true;
        for(int j = 1; j <= n ;j++) {
            if(p.charAt(j) == '*') {
                dp[0][j] = true;
            }else {
                break;
            }
        }
        //状态转移
        for(int i = 1; i <= m; i++) {
            for(int j = 1; j <= n; j++) {
                if(p.charAt(j) == '*') {
                    dp[i][j] = dp[i-1][j] || dp[i][j-1];
                }else {
                    dp[i][j] = (p.charAt(j) == '?' || s.charAt(i) == p.charAt(j)) && dp[i-1][j-1];
                }
            }
        }
        return dp[m][n];
    }
}
